基于GA_XGBoost模型的大学生科研能力预测问题研究

科学评价大学生科研创新能力对我国科研水平的提高具有重要意义.采用机器学习模型来预测大学生科研能力可以起到良好的效果,提出一种GAXGBoost模型来实现对大学生的科研能力预测.此模型是以Xgboost算法为基础,然后充分利用遗传算法的全局搜索能力自动搜索Xgboost最优超参数,避免了人为经验调参不准确的缺陷,最后采用精英选择策略以此确保每一轮都是最佳的进化结果.通过分析表明,所采用的GAXGBoost模型在大学生科研能力预测的结果中具有很高的精度,将此模型与Logistic Regression、Random Forest、SVM等模型进行对比,GAXGBoost模型的预测精度最高.     

Optimal control and numerical methods for hybrid stochastic SIS models

This work focuses on optimal controls of a class of stochastic SIS epidemic models under regime switching. By assuming that a decision maker can influence the infectivity period, our aim is to minimize the expected discounted cost due to illness, medical treatment, and the adverse effect on the society. In addition, a model with the incorporation of vaccination is proposed. Numerical schemes are developed by approximating the continuous-time dynamics using Markov chain approximation methods. It is demonstrated that the approximation schemes converge to the optimal strategy as the mesh size goes to zero. Numerical examples are provided to illustrate our results.     

基于模糊神经元PID算法的注塑机注射速度控制算法研究

基于一款市场较为畅销的注塑机, 设计出一种能精确控制注射速度的模糊神经元PID控制器. 首先, 设计出具有自学能力的神经元PID控制器, 利用模糊算法对其进行优化; 其次, 在原有注射速度线性数学模型的基础上, 构建注塑机注射速度的非线性模型; 最后, 利用MATLAB在所建数学模型的基础上对模糊神经元PID控制器进行仿真实验. 实验结果表明, 所设计控制器具有响应迅速、无超调量、控制精度高、控制稳定等优点.     

游客情感计算的文本大数据挖掘方法比较研究

旅游文本大数据以其方便、快捷和低门槛的特点为游客情感计算提供了极大便利，已经成为旅游大数据的主要来源之一。基于大数据理论和情感理论，以文本大数据为数据源，在全面梳理国内外情感计算相关成果的基础上，利用人工智能中的逻辑/算法编程方法、机器学习方法、深度学习方法对旅游文本大数据进行挖掘，探索最佳的基于文本大数据的游客情感计算方法。研究发现：（1）基于情感词典的游客情感计算模型，其核心是构建情感词典和设计情感计算规则，方法简单，容易实现，适用语料范围广。（2）机器学习，用统计学方法抽取文本中的特征项，具有非线性特征，可靠性较线性特征的情感词典方法高。（3）基于深度学习技术的游客情感计算，效果良好，准确率在85%以上。训练多领域的文本语料易于移植，实用性强，且泛化能力好，较适合大数据时代游客情感计算研究。     

Pure annihilation decay of strange beauty meson into two charm heavy mesons

In this study, the heavy to heavy decay of \begin{document}$ B^0_s\rightarrow D^{*+}D^- $\end{document} is evaluated through the factorization approach by using the final state interaction as an effective correction. Under the factorization approach, this decay mode occurs only through the annihilation process, so a small amount is produced. Feynman's rules state that six meson pairs can be assumed for the intermediate states before the final meson pairs are produced. By taking into account the effects of twelve final state interaction diagrams in the calculations, a significant correction is obtained. These effects correct the value of the branching ratio obtained by the pure factorization approach from \begin{document}$ (2.41\pm1.37)\times10^{-5} $\end{document} to \begin{document}$ (8.27\pm2.23)\times10^{-5} $\end{document}. The value obtained for the branching ratio of the \begin{document}$ B^0_s\rightarrow D^{*+}D^- $\end{document} decay is consistent with the experimental results.     

A novel UPLC–MS/MS method for simultaneous quantification of trigonelline, 4-hydroxyisoleucine,and diosgenin from Trigonella foenum-graecum extract: Application to pharmacokinetic study in healthy and type 2 diabetic rats

Trigonelline (TR), 4-hydroxyisoleucine (4-HI), and diosgenin (DG) are the main bioactives of the purified standardized extract of the popular plant Trigonella foenum-graecum L. (TFG), and it has been proven effective for the treatment of various diseases. However, to the best of our knowledge, no study has investigated the pharmacokinetic parameters of purified standardized T. foenum-graecum extract in normal and diabetic Wistar rats. The present study has developed and validated a rapid, reliable, and sensitive simultaneous ultra-performance liquid chromatography MS method to estimate these bioactives. The chromatographic separation was achieved using methanol, acetonitrile, and 0.1% formic acid with the ideal gradient flow system on a BEH Shield RP 18 column. A positive electrospray ionization mode was selected to estimate m/z values of TR (138.14 > 94.63), 4-HI (148.19 > 74.08), and DG (415.54 > 271.33). The method was robust and reproducible over the linearity range of 60–5000, 6–5000, and 15–5000 ng/mL for TR, 4-HI, and DG, respectively. Using this novel validated method, we investigated the pharmacokinetic parameters of bioactives using Phoenix WinNonlin version 8.0 (Certera) in normal and diabetic rats. The assay was successfully applied for the estimation of pharmacokinetic parameters using noncompartmental analysis. This investigation shows that the absorption rate increased, whereas distribution and elimination processes slowed down in diabetic rats compared with normal rats.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.